A functional central limit theorem in Diophantine approximation
نویسندگان
چکیده
منابع مشابه
Central Limit Theorem and Diophantine Approximations
Let Fn denote the distribution function of the normalized sum Zn = (X1+ · · ·+Xn)/σ √ n of i.i.d. random variables with finite fourth absolute moment. In this paper, polynomial rates of convergence of Fn to the normal law with respect to the Kolmogorov distance, as well as polynomial approximations of Fn by the Edgeworth corrections (modulo logarithmically growing factors in n) are given in ter...
متن کاملA functional combinatorial central limit theorem
The paper establishes a functional version of the Hoeffding combinatorial central limit theorem. First, a pre-limiting Gaussian process approximation is defined, and is shown to be at a distance of the order of the Lyapounov ratio from the original random process. Distance is measured by comparison of expectations of smooth functionals of the processes, and the argument is by way of Stein’s met...
متن کاملA Functional Central Limit Theorem for The
In this paper, we present a functional fluid limit theorem and a functional central limit theorem for a queue with an infinity of servers M/GI/∞. The system is represented by a point-measure valued process keeping track of the remaining processing times of the customers in service. The convergence in law of a sequence of such processes after rescaling is proved by compactness-uniqueness methods...
متن کاملThe central limit theorem and Poisson approximation
2 Poisson approximation 6 2.1 A coupling approach . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.2 Stein’s method for Poisson approximation . . . . . . . . . . . . . . . . . . . . . 8 2.2.1 Independent summands . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 2.2.2 Dependent summands: the local approach . . . . . . . . . . . . . . . . . 10 2.2.3 Size biasing and coup...
متن کاملA functional central limit theorem for PEPA
We present a functional central limit theorem which quantifies, as a stochastic process, the difference between a PEPA model’s underlying CTMC and its fluid approximation. We generalise existing theory to handle the case of non-smooth rate functions, which is an issue particular to modelling problems in computer science. We verify the weak convergence empirically and suggest future avenues for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1991
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1991-0998739-7